#include<iostream>
using namespace std;

#include"Queue.h"

void test_priority_queue1()
{

	bit::priority_queue<int, vector<int>, bit::greater<int>> pq;
	pq.push(2);
	pq.push(1);
	pq.push(4);
	pq.push(3);
	pq.push(7);
	pq.push(8);

	while (!pq.empty())
	{
		cout << pq.top() << " ";
		pq.pop();
	}
	cout << endl;

}
int main()
{
	//Less<int> lessfunc;

	//cout << lessfunc(1, 2) << endl;
	//cout << lessfunc.operator()(1, 2) << endl;
	//cout << Less<int>()(1, 2) << endl;
	test_priority_queue1();

	return 0;
}